Parameter Uncertainty in Multiperiod Portfolio Optimization with Transaction Costs

Multiperiod Portfolio Selection with Different Rates for Borrowing and Lending in Presence of Transaction Costs

Portfolio management is one of the most important areas of research in financial engineering. This paper is concerned with multi period decision problem for financial asset allocation when the rate of borrowing is greater than the rate of lending. Transaction costs as a source of concern for portfolio managers is also considered in this paper. The proposed method of this paper is formulated in ...

Robust multiperiod portfolio management in the presence of transaction costs

We study the viability of different robust optimization approaches to multiperiod portfolio selection. Robust optimization models treat future asset returns as uncertain coefficients in an optimization problem, and map the level of risk aversion of the investor to the level of tolerance of the total error in asset return forecasts.We suggest robust optimization formulations of the multiperiod p...

Portfolio Optimization Under Fixed Transaction Costs

On using shadow prices in portfolio optimization with transaction costs

In frictionless markets, utility maximization problems are typically solved either by stochastic control or by martingale methods. Beginning with the seminal paper of Davis and Norman [Math. Oper. Res. 15 (1990) 676–713], stochastic control theory has also been used to solve various problems of this type in the presence of proportional transaction costs. Martingale methods, on the other hand, h...

Portfolio Optimization under Transaction Costs in the Crr Model Portfolio Optimization under Transaction Costs in the Crr Model

In the CRR model we introduce a transaction cost structure which covers piecewise proportional, fixed and constant costs. For a general utility function we formulate the problem of maximizing the expected utility of terminal wealth as a Markov control problem. An existence result is given and optimal strategies can be described by solutions of the dynamic programming equation. For logarithmic u...